#include<iostream>


using namespace std;
#include"BSTree.h"

int main()
{
	BStree<int> bst;
	int arr[10] = {89,75,23,3,5,78,99,100,34,21};
	for (int i = 0; i < 10; i++)
	{
		bst.insert(arr[i]);
	}
	bst.midOrder(bst.getRoot());
	cout << endl;
	bst.InOrder();
	cout << bst.find(99) << endl;
	return 0;
};